Slow Group Beating

Group beating resulting from ventricular parasystole.

Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the np n+O(1) generator-enumeration algorithm. In previous work with Fabian Wagner, we showed an n logp n+O(logn/ log logn) time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that r...

Beating the generator-enumeration bound for p-group isomorphism

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H . For several decades, the np n+O(1) generatorenumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration boun...

Beating Elo

where EA and EB are the expected outcomes for players A and B, and RA and RB are their ratings. Here we designate a win by 1, a loss by 0, and a draw by 0.5. The spread of the ratings is set by Λ, which for chess ratings is usually taken to be Λ = 400/ log(10) = 173.72. The result of each game updates each player’s rating according to an update rule. The update rule is usually based on the diff...

Non-heart beating donors.

BACKGROUND Several groups have demonstrated that non-heart beating donation is a viable source of organs for transplantation. However, the theoretically worse graft function and survival of the kidneys obtained from non-heart beating donors (NHBDs) is still a matter of debate that has led to consider them as marginal donors for kidney transplantation. METHODS In this report, we compare the ou...